Combined Monte Carlo sampling and penalty method for Stochastic nonlinear complementarity problems
نویسنده
چکیده
In this paper, we consider a new formulation with recourse for a class of stochastic nonlinear complementarity problems. We show that the new formulation is equivalent to a smooth semi-infinite program that no longer contains recourse variables. We then propose a combined Monte Carlo sampling and penalty method for solving the problem in which the underlying sample space is assumed to be compact. Furthermore, we suggest a compact approximation approach for the case where the sample space is unbounded. Two preliminary numerical examples are included as well.
منابع مشابه
Optimality Conditions and Combined Monte Carlo Sampling and Penalty Method for Stochastic Mathematical Programs with Complementarity Constraints and Recourse∗
In this paper, we consider a new formulation for stochastic mathematical programs with complementarity constraints and recourse. We show that the new formulation is equivalent to a smooth semi-infinite program that does no longer contain recourse variables. Optimality conditions for the problem are deduced and connections among the conditions are investigated. Then, we propose a combined Monte ...
متن کاملMonte Carlo Sampling and Penalty Method for Stochastic Mathematical Programs with Complementarity Constraints and Recourse∗
In this paper, we consider a new formulation for stochastic mathematical programs with complementarity constraints and recourse. We show that the new formulation is equivalent to a smooth semi-infinite program. Then, we propose a Monte Carlo sampling and penalty method for solving the problem. Comprehensive convergence analysis and numerical examples are included as well.
متن کاملMonte Carlo and quasi-Monte Carlo sampling methods for a class of stochastic mathematical programs with equilibrium constraints
In this paper, we consider a class of stochastic mathematical programs with equilibrium constraints introduced by Birbil et al. (2004). Firstly, by means of a Monte Carlo method, we obtain a nonsmooth discrete approximation of the original problem. Then, we propose a smoothing method together with a penalty technique to get a standard nonlinear programming problem. Some convergence results are ...
متن کاملAn Ordinal-Optimization-based Approach to Stochastic Mixed Integer Nonlinear Programming
The methods to solve the stochastic MINLP problems fall into two categories: numerical integration method and sample average method. The numerical integration method utilizes numerical integration techniques to calculate the multi-dimensional integrals, such as the Gaussian Quadratures/Cubatures method. The Monte Carlo simulation is one of the most widely used sample average methods. Acevedo an...
متن کاملNew Reformulations and Smoothed Penalty Method for Stochastic Nonlinear Complementarity Problems
We consider the stochastic nonlinear complementarity problem (SNCP), which has been receiving much attention in the recent optimization world. We first formulate the problem as a stochastic mathematical program with equilibrium constraints (SMPEC) and then, in order to develop some efficient methods, we further give some reformulations of the SNCP. In particular, for the case where the random v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 78 شماره
صفحات -
تاریخ انتشار 2009